A Real-time Global Optimal Path Planning for mobile robot in Dynamic Environment Based on Artificial Immune Approach

This paper illustrates a method to finding a globaloptimal path in a dynamic environment of known obstacles foran Mobile Robot (MR) to following a moving target. Firstly, theenvironment is defined by using a practical and standard graphtheory. Then, a suboptimal path is obtained by using DijkstraAlgorithm (DA) that is a standard graph searching method. Theadvantages of using DA are; elimination the uncertainness ofheuristic algorithms and increasing the speed, precision andperformance of them. Finally, Continuous Clonal SelectionAlgorithm (CCSA) that is combined with Negative SelectionAlgorithm (NSA) is used to improve the suboptimal path andderive global optimal path. To show the effectiveness of themethod it is compared with some other methods in this area